Greedy coloring
Results: 25
# | Item |
---|---|
21 | CHAPTER 1 Classical Coloring of GraphsAdd to Reading ListSource URL: fileadmin.cs.lth.seLanguage: English - Date: 2008-11-06 10:42:59 |
22 | The road coloring problem celebration of 10 years of F’SATIE Dominique PerrinAdd to Reading ListSource URL: www-igm.univ-mlv.frLanguage: English - Date: 2007-12-17 10:04:20 |
23 | CSC373S Lecture 2 • Last time we ended by claiming that a greedy algorithm (lets call it EFT for earliest finishing time) that sorts intervals by their finishing times (ties can be broken arbitrarily) and then accepts “greedily” is an optimal algorithm for the interval selectionAdd to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2011-01-20 08:49:33 |
24 | PDF DocumentAdd to Reading ListSource URL: www.cs.toronto.eduLanguage: English - Date: 2013-01-11 15:27:25 |
25 | PDF DocumentAdd to Reading ListSource URL: people.math.gatech.eduLanguage: English - Date: 2011-11-28 08:32:39 |